Low order integral-action controller synthesis

A simple controller synthesis method is developed for certain classes of linear, time-invariant, multi-input multi-output plants. The number of poles in each entry of these controllers depends on the number of right-half plane plant zeros, and is independent of the number of poles of the plant to be stabilized. Furthermore, these controllers have integral-action so that they achieve asymptotic tracking of step input references with zero steady-state error. The designed controller’s poles and zeros are all in the stable region with the exception of one pole at the origin for the integral-action design requirement. The freedom available in the design parameters may be used for additional performance objectives, although the only goal here is stabilization and tracking of constant references.     

基于行为能力约束的服务动态授权管理研究

针对传统基于语义服务动态合成的低效率和授权管理的有效性不高,提出了基于行为能力约束的服务动态授权管理方法。该方法借助数学优化模型,对服务合成的路径进行了描述,根据成份服务间的约束关系,提出了协同应用服务动态合成算法。基于行为能力约束,将服务合成的语义推理进行预先处理,探索构成协同应用服务的最小行为能力,根据服务请求用户所拥有的行为能力与协同应用服务所需的最小行为能力的关系进行判断授权,避免了用户提出服务请求时的大规模空间搜索和服务语义间的推理计算问题。实验结果分析表明,该方法提高了服务授权管理的自动化程度和有效性,并且具有较高的动态适应能力。     

Structured Reactive Controllers

Service robots, such as autonomous office couriers or robot tourguides, must be both reliable and efficient. This requires them to flexibly interleave their tasks, exploit opportunities, quickly plan their course of action, and, if necessary, revise their intended activities. In this paper, we show how structured reactive controllers (SRCs) satisfy these requirements. The novel feature of SRCs is that they employ and reason about plans that specify and synchronize concurrent percept-driven behavior. Powerful control abstractions enable SRCs to integrate physical action, perception, planning, and communication in a uniform framework and to apply fast but imperfect computational methods without sacrificing reliability and flexibility. Concurrent plans are represented in a transparent and modular form so that automatic planning processes can reason about the plans and revise them. We present experiments in which SRCs are used to control two autonomous mobile robots. In one of them an SRC controlled the course of action of a museum tourguide robot that has operated for thirteen days, more than ninetyfour hours, completed 620 tours, and presented 2668 exhibits.     

安全和可控信息网的研究

该文论述了在局域网建立安全信息体系的意义,对信息不可控给网络造成的影响进行了概述。并以一个大学校园网,就建立可控网络和信息过滤的方法及实现进行了探讨,对网络性能的影响进行了分析论述。     

Service Discovery and Negotiation With COWS

To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform formalism for modelling all the relevant phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, deployment and execution. In this paper, we show that constraints and operations on them can be smoothly incorporated in COWS, and propose a disciplined way to model multisets of constraints and to manipulate them through appropriate interaction protocols. Therefore, we demonstrate that also QoS requirement specifications and SLA achievements, and the phases of dynamic service discovery and negotiation can be comfortably modelled in COWS. We illustrate our approach through a scenario for a service-based web hosting provider.     

Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5

We begin by showing how to faithfully encode the Classical ModalDisplay Logic (CMDL) of Wansing into the Calculus of Structures(CoS) of Guglielmi. Since every CMDL calculus enjoys cut-elimination,we obtain a cut-elimination theorem for all corresponding CoScalculi. We then show how our result leads to a minimal cut-freeCoS calculus for modal logic S5. No other existing CoS calculifor S5 enjoy both these properties simultaneously.     

Goal Change in the Situation Calculus

Although there has been much discussion of belief change (e.g.[4, 21]), goal change has not received much attention. In thispaper, we propose a method for goal change in the frameworkof Reiter's; [12] theory of action in the situation calculus[8, 10], and investigate its properties. We extend the frameworkdeveloped by Shapiro et al. [17] and Shapiro and Lespérance[16], where goals and goal expansion were modelled, but goalcontraction was not.     

Modelling Calculi with Name Mobility using Graphs with Equivalences

In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to be quite useful for modelling purposes, but, at the same time, problematic for the development of a satisfactory partial order concurrent semantics for rewrites. Rewriting over graphs with equivalences, i.e., (typed hyper)-graphs equipped with an equivalence over nodes provides a technically convenient replacement of graph rewriting with coalescing rules, for which a truly concurrent semantics can be easily defined. The expressivity of such a formalism is tested in a setting where coalescing rules typically play a basic role: the encoding of calculi with name passing as graph rewriting systems. Specifically, we show how the (monadic fragment) of the solo calculus, one of the dialect of those calculi whose distinctive feature is name fusion, can be encoded as a rewriting system over graph with equivalences.     

Toxicoproteomics and its application to human health risk assessment

Toxicoproteomics is the use of proteomic technologies to better understand environmental and genetic factors, toxic mechanisms, and modes of action in response to acute exposure to toxicants and in the long-term development of diseases caused or influenced by these exposures. Use of toxicoproteomic technologies to identify key biochemical pathways, mechanisms, and biomarkers of exposure and toxicity will decrease the uncertainties that are associated with human health risk assessments. This review provides an overview of toxicoproteomics from human health risk assessment perspectives. Key toxicoproteomic technologies such as 2-D gel-based proteomic methods and toxicoproteomic approaches are described, and examples of applications of these technologies and methodologies in the risk assessment context are presented. The discussion includes a focus on challenges and future directions.